def func():
q = int(input())
for _ in range(q):
linha = input().split()
n = int(linha[0])
moves = int(linha[1])
string = input()
deslocamentos = 0
ones = 0
zeros = 0
feito = False
ans = ""
for i in range(n):
if string[i] == "1":
ones += 1
else:
if deslocamentos + ones <= moves:
ans += "0"
deslocamentos += ones
zeros += 1
else:
ans += "1" * (deslocamentos + ones - moves)
ans += "0"
ans += "1" * (moves - deslocamentos)
ans += string[i+1:]
print(ans)
feito = True
break
if not feito:
ans += "1" * (ones)
print(ans)
func()
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |